Boosting the Performance of SLS and CDCL Solvers by Preprocessor Tuning
نویسندگان
چکیده
Preprocessing techniques are crucial for SAT solvers when it comes to reaching state-of-the-art performance as it was shown by the results of the last SAT Competitions. The usefulness of a preprocessing technique depends highly on its own parameters, on the instances on which it is applied and on the used solver. In this paper we first give an extended analysis of the performance gain reached by using different preprocessing techniques individually in combination with CDCL solvers on application instances and SLS solvers on crafted instances. Further, we provide an analysis of combinations of preprocessing techniques by means of automated algorithm configuration, where we search for optimal preprocessor configurations for different scenarios. Our results show that the performance of CDCL and especially of SLS solvers can be further improved when using appropriate preprocessor configurations. The solvers augmented with the best found preprocessing configurations outperform the original solvers on the instances from the SAT Challenge 2012, achieving new state-of-the-art results.
منابع مشابه
Boosting SLS Performance by Incorporating Resolution-based Preprocessor
State of the art Stochastic Local Search (SLS) solvers have difficulty in solving many CNF-encoded realistic SAT problems, apparently because they are unable to exploit hidden structure as well as systematic solvers. Recent work has shown that SLS solvers may benefit from a preprocessing phase borrowed from systematic SAT solving. In this paper, we report an extensive empirical examination of t...
متن کاملImproving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses
Stochastic Local Search (SLS) solvers are considered one of the best solving technique for randomly generated problems and more recently also have shown great promise for several types of hard combinatorial problems. Within this work, we provide a thorough analysis of different implementation variants of SLS solvers on random and on hard combinatorial problems. By analyzing existing SLS impleme...
متن کاملMultiple Preprocessing for Systematic SAT Solvers
High-performance SAT solvers based on systematic search generally use either conflict driven clause learning (CDCL) or lookahead techniques to gain efficiency. Both styles of reasoning can gain from a preprocessing phase in which some form of deduction is used to simplify the problem. In this paper we undertake an empirical examination of the effects of several recently proposed preprocessors o...
متن کاملStochastic Local Search for SMT: Combining Theory Solvers with WalkSAT
A dominant approach to Satisfiability Modulo Theories (SMT) relies on the integration of a Conflict-Driven-Clause-Learning (CDCL) SAT solver and of a decision procedure able to handle sets of atomic constraints in the underlying theory T (T -solver). In pure SAT, however, Stochastic Local-Search (SLS) procedures sometimes are competitive with CDCL SAT solvers on satisfiable instances. Thus, it ...
متن کاملNon-Restarting SAT Solvers with Simple Preprocessing Can Efficiently Simulate Resolution
Propositional satisfiability (SAT) solvers based on conflict directed clause learning (CDCL) implicitly produce resolution refutations of unsatisfiable formulas. The precise class of formulas for which they can produce polynomial size refutations has been the subject of several studies, with special focus on the clause learning aspect of these solvers. The results, however, assume the use of no...
متن کامل